class Solution {//leetcode674——最长连续递增序列
public:
    int findLengthOfLCIS(vector<int>& nums) {
        int n=nums.size();
        int ret=1;
        int cnt=1;
        for(int j=1;j<n;j++){
            if(nums[j]>nums[j-1]) {
                cnt++;
                ret=max(ret,cnt);
            }
            else {
                cnt=1;
            }
        }
        return ret;
    }
};